The Enhanced Principal Rank Characteristic Sequence for Hermitian Matrices
نویسندگان
چکیده
The enhanced principal rank characteristic sequence (epr-sequence) of an n×n matrix is a sequence `1`2 · · ·`n, where each `k is A, S, or N according as all, some, or none of its principal minors of order k are nonzero. There has been substantial work on epr-sequences of symmetric matrices (especially real symmetric matrices) and real skew-symmetric matrices, and incidental remarks have been made about results extending (or not extending) to (complex) Hermitian matrices. A systematic study of epr-sequences of Hermitian matrices is undertaken; the differences with the case of symmetric matrices are quite striking. Various results are established regarding the attainability by Hermitian matrices of epr-sequences that contain two Ns with a gap in between. Hermitian adjacency matrices of mixed graphs that begin with NAN are characterized. All attainable epr-sequences of Hermitian matrices of orders 2, 3, 4, and 5, are listed with justifications.
منابع مشابه
The enhanced principal rank characteristic sequence over a field of characteristic 2
The enhanced principal rank characteristic sequence (epr-sequence) of an n× n symmetric matrix over a field F was recently defined as `1`2 · · · `n, where `k is either A, S, or N based on whether all, some (but not all), or none of the order-k principal minors of the matrix are nonzero. Here, a complete characterization of the epr-sequences that are attainable by symmetric matrices over the fie...
متن کاملThe principal rank characteristic sequence over various
7 Given an n × n matrix, its principal rank characteristic sequence is a sequence of 8 length n + 1 of 0s and 1s where, for k = 0, 1, . . . , n, a 1 in the kth position indicates 9 the existence of a principal submatrix of rank k and a 0 indicates the absence of such 10 a submatrix. The principal rank characteristic sequences for symmetric matrices over 11 various fields are investigated, with ...
متن کاملThe principal rank characteristic sequence over various fields
Given an n × n matrix, its principal rank characteristic sequence is a sequence of length n + 1 of 0s and 1s where, for k = 0, 1, . . . , n, a 1 in the kth position indicates the existence of a principal submatrix of rank k and a 0 indicates the absence of such a submatrix. The principal rank characteristic sequences for symmetric matrices over various fields are investigated, with all such att...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملOn the Principal Permanent Rank Characteristic Sequences of Graphs and Digraphs
The principal permanent rank characteristic sequence is a binary sequence r0r1 · · · rn where rk = 1 if there exists a principal square submatrix of size k with nonzero permanent and rk = 0 otherwise, and r0 = 1 if there is a zero diagonal entry. A characterization is provided for all principal permanent rank sequences obtainable by the family of nonnegative matrices as well as the family of no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017